________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        31.01.2010 10:55:55
Input Data from:  dataset144.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :100
# of Locations  :20
Ex.Facilities   :3
Total budget    :25000
Terror. attacks :1

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,132
Average f[i]   :4475
Average g[i,j] :1880,39215686275
Total demand   :5310
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 69
> Selected Move:	2570	1	-1	15	4000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0    >new incumb.: 2570


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 68
> Selected Move:	3010	1	-1	12	10000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0    >new incumb.: 3010


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 68
> Selected Move:	3350	1	-1	5	16000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  0  0  1  0  0  1  0  0  0  0    >new incumb.: 3350


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 82
> Selected Move:	3740	1	-1	7	22500


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  0  0  0  0  1  0  0  1  0  0  0  0    >new incumb.: 3740


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 63
> Selected Move:	3710	3	7	4	20500


> New Y[]: 
	
	 2  3  4  0  1  1  0  0  0  0  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 65
> Selected Move:	3760	1	-1	8	25000


> New Y[]: 
	
	 2  3  4  0  1  1  0  0  1  0  0  0  1  0  0  1  0  0  0  0    >new incumb.: 3760


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 44
> Selected Move:	3750	3	4	10	25000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  1  0  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 43
> Selected Move:	3740	3	8	4	25000


> New Y[]: 
	
	 2  3  4  0  1  1  0  0  0  0  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 33
> Selected Move:	3720	3	4	19	25000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  1  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 53
> Selected Move:	3720	3	10	8	25000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  1  0  0  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 58
> Selected Move:	3710	3	8	4	25000


> New Y[]: 
	
	 2  3  4  0  1  1  0  0  0  0  0  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 71
> Selected Move:	3710	3	19	9	24500


> New Y[]: 
	
	 2  3  4  0  1  1  0  0  0  1  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 48
> Selected Move:	3830	3	5	11	24000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  1  0  1  1  0  0  1  0  0  0  0    >new incumb.: 3830


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 67
> Selected Move:	3790	3	4	19	24000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  1  0  1  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 88
> Selected Move:	3730	3	12	17	23000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  1  0  1  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 100
> Selected Move:	3830	3	9	5	25000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  0  1  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 70
> Selected Move:	3850	3	19	4	25000


> New Y[]: 
	
	 2  3  4  0  1  1  0  0  0  0  0  1  0  0  0  1  0  1  0  0    >new incumb.: 3850


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 73
> Selected Move:	3750	3	5	9	23000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  1  0  1  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 105
> Selected Move:	3750	3	4	7	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  1  0  1  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 69
> Selected Move:	3740	3	11	16	24500


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  1  0  0  0  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 79
> Selected Move:	3670	3	16	6	24500


> New Y[]: 
	
	 2  3  4  0  0  0  1  1  0  1  0  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 79
> Selected Move:	3670	3	6	8	24000


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  1  1  0  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 86
> Selected Move:	3830	3	17	12	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  1  1  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 43
> Selected Move:	3660	3	7	4	23000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  1  1  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 24 #######################


> Neighbours evaluated; 79
> Selected Move:	3690	3	9	11	24500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  1  0  0  1  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 25 #######################


> Neighbours evaluated; 67
> Selected Move:	3690	3	8	6	25000


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  0  0  0  1  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 26 #######################


> Neighbours evaluated; 72
> Selected Move:	3690	3	6	16	25000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  0  1  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 27 #######################


> Neighbours evaluated; 74
> Selected Move:	3680	3	4	10	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  1  1  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,39

## ITERATION 28 #######################


> Neighbours evaluated; 72
> Selected Move:	3680	3	16	8	24500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  1  1  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,385

## ITERATION 29 #######################


> Neighbours evaluated; 54
> Selected Move:	3650	3	10	19	24500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  1  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 30 #######################


> Neighbours evaluated; 86
> Selected Move:	3650	3	8	6	25000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  0  1  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 31 #######################


> Neighbours evaluated; 79
> Selected Move:	3650	3	6	16	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  1  1  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 32 #######################


> Neighbours evaluated; 81
> Selected Move:	3630	3	16	4	24500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  0  1  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 33 #######################


> Neighbours evaluated; 89
> Selected Move:	3630	3	19	10	24500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  1  1  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 34 #######################


> Neighbours evaluated; 47
> Selected Move:	3640	3	4	9	24000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  1  1  1  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,355

## ITERATION 35 #######################


> Neighbours evaluated; 48
> Selected Move:	3840	3	11	6	23500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  1  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 36 #######################


> Neighbours evaluated; 88
> Selected Move:	3810	3	6	3	24500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  1  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,345

## ITERATION 37 #######################


> Neighbours evaluated; 72
> Selected Move:	3660	3	10	4	24500


> New Y[]: 
	
	 2  3  4  1  1  0  0  0  0  1  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 38 #######################


> Neighbours evaluated; 68
> Selected Move:	3660	3	3	6	23500


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  0  1  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 39 #######################


> Neighbours evaluated; 96
> Selected Move:	3663	3	4	7	25500


> New Y[]: 
	
	 2  3  4  0  0  0  1  1  0  1  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 40 #######################


> Neighbours evaluated; 55
> Selected Move:	3665	3	6	16	25500


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  1  0  0  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 41 #######################


> Neighbours evaluated; 54
> Selected Move:	3660	3	7	4	23500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  1  0  0  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 42 #######################


> Neighbours evaluated; 95
> Selected Move:	3650	3	4	10	23500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  1  1  0  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,315

## ITERATION 43 #######################


> Neighbours evaluated; 92
> Selected Move:	3653	3	1	7	25500


> New Y[]: 
	
	 2  0  4  0  0  0  0  3  0  1  1  0  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,31

## ITERATION 44 #######################


> Neighbours evaluated; 52
> Selected Move:	3810	3	16	8	25000


> New Y[]: 
	
	 2  0  4  0  0  0  0  3  1  1  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,305

## ITERATION 45 #######################


> Neighbours evaluated; 32
> Selected Move:	3749	4	7	12	25200


> New Y[]: 
	
	 2  0  4  0  0  0  0  1  1  1  1  0  3  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,3

## ITERATION 46 #######################


> Neighbours evaluated; 35
> Selected Move:	3660	3	7	4	23200


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  1  1  1  0  3  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 47 #######################


> Neighbours evaluated; 64
> Selected Move:	3800	3	8	11	24200


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  1  1  1  3  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,29

## ITERATION 48 #######################


> Neighbours evaluated; 53
> Selected Move:	3780	3	4	19	24200


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  1  1  1  3  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,285

## ITERATION 49 #######################


> Neighbours evaluated; 67
> Selected Move:	3723	4	12	11	25200


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  1  1  3  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,28

## ITERATION 50 #######################


> Neighbours evaluated; 51
> Selected Move:	3744	3	19	4	25200


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  1  1  3  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,275

## ITERATION 51 #######################


> Neighbours evaluated; 44
> Selected Move:	3690	3	12	17	24200


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  1  1  3  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 52 #######################


> Neighbours evaluated; 82
> Selected Move:	3690	4	11	10	24600


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  1  3  1  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 53 #######################


> Neighbours evaluated; 86
> Selected Move:	3690	4	10	17	24000


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  1  1  1  0  0  0  1  0  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 54 #######################


> Neighbours evaluated; 88
> Selected Move:	3670	3	4	19	24000


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  1  1  1  0  0  0  1  0  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 55 #######################


> Neighbours evaluated; 73
> Selected Move:	3670	4	17	10	24600


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  1  3  1  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 56 #######################


> Neighbours evaluated; 64
> Selected Move:	3670	4	10	11	24200


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  1  1  3  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 57 #######################


> Neighbours evaluated; 68
> Selected Move:	3670	4	11	19	24500


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  1  1  1  0  0  0  1  0  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 58 #######################


> Neighbours evaluated; 69
> Selected Move:	3690	3	19	7	25000


> New Y[]: 
	
	 2  0  4  0  0  0  0  3  0  1  1  1  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 59 #######################


> Neighbours evaluated; 84
> Selected Move:	3680	3	11	16	24500


> New Y[]: 
	
	 2  0  4  0  0  0  0  3  0  1  1  0  0  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 60 #######################


> Neighbours evaluated; 88
> Selected Move:	3610	3	16	6	24500


> New Y[]: 
	
	 2  0  4  0  0  0  1  3  0  1  1  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 61 #######################


> Neighbours evaluated; 92
> Selected Move:	3718	3	17	12	25500


> New Y[]: 
	
	 2  0  4  0  0  0  1  3  0  1  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 62 #######################


> Neighbours evaluated; 50
> Selected Move:	3676	4	7	12	25700


> New Y[]: 
	
	 2  0  4  0  0  0  1  1  0  1  1  0  3  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 63 #######################


> Neighbours evaluated; 64
> Selected Move:	3660	3	6	16	25700


> New Y[]: 
	
	 2  0  4  0  0  0  0  1  0  1  1  0  3  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,21

## ITERATION 64 #######################


> Neighbours evaluated; 64
> Selected Move:	3660	3	7	4	23700


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  1  1  0  3  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 65 #######################


> Neighbours evaluated; 94
> Selected Move:	3680	3	16	5	24700


> New Y[]: 
	
	 2  0  4  0  1  1  0  0  0  1  1  0  3  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,2

## ITERATION 66 #######################


> Neighbours evaluated; 42
> Selected Move:	3720	3	9	8	25200


> New Y[]: 
	
	 2  0  4  0  1  1  0  0  1  0  1  0  3  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 67 #######################


> Neighbours evaluated; 56
> Selected Move:	3700	3	12	17	25000


> New Y[]: 
	
	 2  0  4  0  1  1  0  0  1  0  1  0  0  0  0  1  0  3  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 68 #######################


> Neighbours evaluated; 79
> Selected Move:	3700	4	17	5	24600


> New Y[]: 
	
	 2  0  4  0  1  3  0  0  1  0  1  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 69 #######################


> Neighbours evaluated; 87
> Selected Move:	3682	3	8	6	25100


> New Y[]: 
	
	 2  0  4  0  1  3  1  0  0  0  1  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 70 #######################


> Neighbours evaluated; 86
> Selected Move:	3681	3	6	16	25100


> New Y[]: 
	
	 2  0  4  0  1  3  0  0  0  0  1  0  0  0  0  1  1  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 71 #######################


> Neighbours evaluated; 86
> Selected Move:	3673	3	16	11	25600


> New Y[]: 
	
	 2  0  4  0  1  3  0  0  0  0  1  1  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 72 #######################


> Neighbours evaluated; 81
> Selected Move:	3670	3	5	9	25100


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  3  1  1  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 73 #######################


> Neighbours evaluated; 76
> Selected Move:	3670	4	9	15	25100


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  1  1  1  0  0  0  3  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 74 #######################


> Neighbours evaluated; 80
> Selected Move:	3649	3	4	19	25100


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  1  1  1  0  0  0  3  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 75 #######################


> Neighbours evaluated; 60
> Selected Move:	3649	4	15	9	25100


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  3  1  1  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 76 #######################


> Neighbours evaluated; 70
> Selected Move:	3638	3	9	5	25600


> New Y[]: 
	
	 2  0  4  0  0  3  0  0  0  0  1  1  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 77 #######################


> Neighbours evaluated; 68
> Selected Move:	3660	3	11	8	24600


> New Y[]: 
	
	 2  0  4  0  0  3  0  0  1  0  1  0  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 78 #######################


> Neighbours evaluated; 69
> Selected Move:	3660	4	5	17	25000


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  1  0  1  0  0  0  0  1  0  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 79 #######################


> Neighbours evaluated; 68
> Selected Move:	3673	3	17	12	25200


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  1  0  1  0  3  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 80 #######################


> Neighbours evaluated; 61
> Selected Move:	3660	3	8	9	24700


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  1  1  0  3  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,245

## ITERATION 81 #######################


> Neighbours evaluated; 57
> Selected Move:	3660	2	9	-1	20700


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  0  1  0  3  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,25

## ITERATION 82 #######################


> Neighbours evaluated; 83
> Selected Move:	3680	3	19	4	20700


> New Y[]: 
	
	 2  0  4  0  1  1  0  0  0  0  1  0  3  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,255

## ITERATION 83 #######################


> Neighbours evaluated; 55
> Selected Move:	3680	4	12	4	22900


> New Y[]: 
	
	 2  0  4  0  3  1  0  0  0  0  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,25

## ITERATION 84 #######################


> Neighbours evaluated; 54
> Selected Move:	3680	4	4	5	21100


> New Y[]: 
	
	 2  0  4  0  1  3  0  0  0  0  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,245

## ITERATION 85 #######################


> Neighbours evaluated; 57
> Selected Move:	3680	4	5	10	22100


> New Y[]: 
	
	 2  0  4  0  1  1  0  0  0  0  3  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,24

## ITERATION 86 #######################


> Neighbours evaluated; 54
> Selected Move:	3680	4	10	15	22600


> New Y[]: 
	
	 2  0  4  0  1  1  0  0  0  0  1  0  1  0  0  3  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,235

## ITERATION 87 #######################


> Neighbours evaluated; 55
> Selected Move:	3680	3	4	7	24600


> New Y[]: 
	
	 2  0  4  0  0  1  0  1  0  0  1  0  1  0  0  3  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,23

## ITERATION 88 #######################


> Neighbours evaluated; 43
> Selected Move:	3680	4	15	5	23100


> New Y[]: 
	
	 2  0  4  0  0  3  0  1  0  0  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,225

## ITERATION 89 #######################


> Neighbours evaluated; 53
> Selected Move:	3680	4	5	7	22500


> New Y[]: 
	
	 2  0  4  0  0  1  0  3  0  0  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,22

## ITERATION 90 #######################


> Neighbours evaluated; 54
> Selected Move:	3680	4	7	10	24100


> New Y[]: 
	
	 2  0  4  0  0  1  0  1  0  0  3  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,215

## ITERATION 91 #######################


> Neighbours evaluated; 48
> Selected Move:	3680	4	10	12	22700


> New Y[]: 
	
	 2  0  4  0  0  1  0  1  0  0  1  0  3  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,21

## ITERATION 92 #######################


> Neighbours evaluated; 68
> Selected Move:	3600	3	2	8	24200


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  4  0  1  0  3  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 93 #######################


> Neighbours evaluated; 52
> Selected Move:	3600	4	8	5	23300


> New Y[]: 
	
	 2  0  0  0  0  4  0  1  1  0  1  0  3  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 94 #######################


> Neighbours evaluated; 60
> Selected Move:	3600	4	5	7	22600


> New Y[]: 
	
	 2  0  0  0  0  1  0  4  1  0  1  0  3  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 95 #######################


> Neighbours evaluated; 61
> Selected Move:	3600	4	7	12	22800


> New Y[]: 
	
	 2  0  0  0  0  1  0  3  1  0  1  0  4  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 96 #######################


> Neighbours evaluated; 61
> Selected Move:	3600	4	7	5	23400


> New Y[]: 
	
	 2  0  0  0  0  3  0  1  1  0  1  0  4  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 97 #######################


> Neighbours evaluated; 57
> Selected Move:	3600	4	5	8	24300


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  3  0  1  0  4  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 98 #######################


> Neighbours evaluated; 49
> Selected Move:	3600	4	8	10	24400


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  1  0  3  0  4  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 99 #######################


> Neighbours evaluated; 42
> Selected Move:	3660	3	10	1	22800


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  0  0  0  4  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 100 #######################


> Neighbours evaluated; 66
> Selected Move:	3660	4	12	5	23100


> New Y[]: 
	
	 2  3  0  0  0  4  0  1  1  0  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 101 #######################


> Neighbours evaluated; 66
> Selected Move:	3660	4	5	7	22400


> New Y[]: 
	
	 2  3  0  0  0  1  0  4  1  0  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 102 #######################


> Neighbours evaluated; 67
> Selected Move:	3660	4	7	8	24000


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  4  0  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 103 #######################


> Neighbours evaluated; 64
> Selected Move:	3630	3	8	16	24700


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  0  0  0  1  0  0  1  4  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 104 #######################


> Neighbours evaluated; 60
> Selected Move:	3630	4	16	5	23600


> New Y[]: 
	
	 2  3  0  0  0  4  0  1  0  0  0  0  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 105 #######################


> Neighbours evaluated; 77
> Selected Move:	3630	4	5	7	22900


> New Y[]: 
	
	 2  3  0  0  0  1  0  4  0  0  0  0  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 106 #######################


> Neighbours evaluated; 81
> Selected Move:	3630	4	7	12	23300


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  0  0  0  4  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 107 #######################


> Neighbours evaluated; 86
> Selected Move:	3620	3	5	9	21300


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  1  0  0  4  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 108 #######################


> Neighbours evaluated; 81
> Selected Move:	3620	4	12	7	20900


> New Y[]: 
	
	 2  3  0  0  0  0  0  4  0  1  0  0  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 109 #######################


> Neighbours evaluated; 80
> Selected Move:	3665	1	-1	11	26400


> New Y[]: 
	
	 2  3  0  0  0  0  0  4  0  1  0  1  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 110 #######################


> Neighbours evaluated; 70
> Selected Move:	3732	3	16	8	25900


> New Y[]: 
	
	 2  3  0  0  0  0  0  4  1  1  0  1  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 111 #######################


> Neighbours evaluated; 55
> Selected Move:	3691	4	7	12	26300


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  1  0  1  4  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,11

## ITERATION 112 #######################


> Neighbours evaluated; 52
> Selected Move:	3680	3	7	4	24300


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  1  0  1  4  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,105

## ITERATION 113 #######################


> Neighbours evaluated; 70
> Selected Move:	3680	4	12	11	24900


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  1  0  4  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0999999999999996

## ITERATION 114 #######################


> Neighbours evaluated; 72
> Selected Move:	3660	3	4	10	24900


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  1  4  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,0949999999999996

## ITERATION 115 #######################


> Neighbours evaluated; 58
> Selected Move:	3670	3	11	4	24700


> New Y[]: 
	
	 2  3  0  0  4  0  0  0  1  1  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0899999999999996

## ITERATION 116 #######################


> Neighbours evaluated; 56
> Selected Move:	3670	4	4	8	24500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  4  1  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0849999999999996

## ITERATION 117 #######################


> Neighbours evaluated; 58
> Selected Move:	3670	4	8	12	23300


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  1  1  0  4  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0799999999999996

## ITERATION 118 #######################


> Neighbours evaluated; 74
> Selected Move:	3660	3	4	11	24300


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  1  1  4  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,0749999999999996

## ITERATION 119 #######################


> Neighbours evaluated; 60
> Selected Move:	3723	3	1	7	26300


> New Y[]: 
	
	 2  0  0  0  0  0  0  3  1  1  1  1  4  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,0699999999999996

## ITERATION 120 #######################


> Neighbours evaluated; 47
> Selected Move:	3743	4	7	12	26100


> New Y[]: 
	
	 2  0  0  0  0  0  0  4  1  1  1  1  3  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,0649999999999996

## ITERATION 121 #######################


> Neighbours evaluated; 52
> Selected Move:	3719	3	9	5	28100


> New Y[]: 
	
	 2  0  0  0  0  1  0  4  1  0  1  1  3  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,0599999999999996

## ITERATION 122 #######################


> Neighbours evaluated; 50
> Selected Move:	3722	4	7	12	28300


> New Y[]: 
	
	 2  0  0  0  0  1  0  3  1  0  1  1  4  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,0549999999999996

## ITERATION 123 #######################


> Neighbours evaluated; 50
> Selected Move:	3722	4	12	5	28600


> New Y[]: 
	
	 2  0  0  0  0  4  0  3  1  0  1  1  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,0599999999999996

## ITERATION 124 #######################


> Neighbours evaluated; 43
> Selected Move:	3750	3	5	2	26500


> New Y[]: 
	
	 2  0  4  0  0  0  0  3  1  0  1  1  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,0649999999999996

## ITERATION 125 #######################


> Neighbours evaluated; 49
> Selected Move:	3780	3	11	5	27000


> New Y[]: 
	
	 2  0  4  0  0  1  0  3  1  0  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,0699999999999996

## ITERATION 126 #######################


> Neighbours evaluated; 53
> Selected Move:	3756	4	7	12	27200


> New Y[]: 
	
	 2  0  4  0  0  1  0  1  1  0  1  0  3  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,0749999999999996

## ITERATION 127 #######################


> Neighbours evaluated; 48
> Selected Move:	3728	3	8	6	27700


> New Y[]: 
	
	 2  0  4  0  0  1  1  1  0  0  1  0  3  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,0799999999999996

## ITERATION 128 #######################


> Neighbours evaluated; 71
> Selected Move:	3730	4	12	7	27500


> New Y[]: 
	
	 2  0  4  0  0  1  1  3  0  0  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,0849999999999996

## ITERATION 129 #######################


> Neighbours evaluated; 54
> Selected Move:	3898	3	7	1	25500


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  0  0  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0899999999999996

## ITERATION 130 #######################


> Neighbours evaluated; 98
> Selected Move:	3775	3	6	3	26500


> New Y[]: 
	
	 2  3  4  1  0  1  0  0  0  0  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,0949999999999996

## ITERATION 131 #######################


> Neighbours evaluated; 83
> Selected Move:	3703	3	3	16	25500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  1  0  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,0999999999999996

## ITERATION 132 #######################


> Neighbours evaluated; 101
> Selected Move:	3710	3	10	4	25500


> New Y[]: 
	
	 2  3  4  0  1  1  0  0  0  0  0  0  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,105

## ITERATION 133 #######################


> Neighbours evaluated; 98
> Selected Move:	3825	3	16	11	26000


> New Y[]: 
	
	 2  3  4  0  1  1  0  0  0  0  0  1  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,11

## ITERATION 134 #######################


> Neighbours evaluated; 65
> Selected Move:	3780	3	4	19	26000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  0  1  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 135 #######################


> Neighbours evaluated; 98
> Selected Move:	3670	3	11	9	24500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  1  0  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 136 #######################


> Neighbours evaluated; 100
> Selected Move:	3670	2	9	-1	20500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  0  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 137 #######################


> Neighbours evaluated; 93
> Selected Move:	3660	3	1	10	22100


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  0  3  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,13

## ITERATION 138 #######################


> Neighbours evaluated; 84
> Selected Move:	3660	4	10	5	21100


> New Y[]: 
	
	 2  0  4  0  0  3  0  0  0  0  1  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,135

## ITERATION 139 #######################


> Neighbours evaluated; 83
> Selected Move:	3664	1	-1	11	26600


> New Y[]: 
	
	 2  0  4  0  0  3  0  0  0  0  1  1  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,14

## ITERATION 140 #######################


> Neighbours evaluated; 59
> Selected Move:	3712	4	5	12	26200


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  0  1  1  3  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,145

## ITERATION 141 #######################


> Neighbours evaluated; 69
> Selected Move:	3726	3	19	4	26200


> New Y[]: 
	
	 2  0  4  0  1  1  0  0  0  0  1  1  3  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,15

## ITERATION 142 #######################


> Neighbours evaluated; 49
> Selected Move:	3690	3	5	8	24700


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  1  0  1  1  3  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 143 #######################


> Neighbours evaluated; 70
> Selected Move:	3659	3	8	6	25200


> New Y[]: 
	
	 2  0  4  0  1  0  1  0  0  0  1  1  3  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 144 #######################


> Neighbours evaluated; 74
> Selected Move:	3660	3	11	9	23700


> New Y[]: 
	
	 2  0  4  0  1  0  1  0  0  1  1  0  3  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 145 #######################


> Neighbours evaluated; 83
> Selected Move:	3660	4	12	6	24800


> New Y[]: 
	
	 2  0  4  0  1  0  3  0  0  1  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 146 #######################


> Neighbours evaluated; 73
> Selected Move:	3665	3	6	5	25100


> New Y[]: 
	
	 2  0  4  0  1  3  0  0  0  1  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,155

## ITERATION 147 #######################


> Neighbours evaluated; 53
> Selected Move:	3667	3	9	8	25600


> New Y[]: 
	
	 2  0  4  0  1  3  0  0  1  0  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 148 #######################


> Neighbours evaluated; 65
> Selected Move:	3644	3	5	9	25100


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  1  3  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 149 #######################


> Neighbours evaluated; 55
> Selected Move:	3660	4	9	8	24500


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  3  1  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 150 #######################


> Neighbours evaluated; 59
> Selected Move:	3660	4	8	10	24600


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  1  1  3  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 151 #######################


> Neighbours evaluated; 57
> Selected Move:	3695	3	8	11	25600


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  1  3  1  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,18

## ITERATION 152 #######################


> Neighbours evaluated; 47
> Selected Move:	3672	3	4	19	25600


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  1  3  1  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,185

## ITERATION 153 #######################


> Neighbours evaluated; 53
> Selected Move:	3688	4	10	19	25500


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  1  1  1  1  0  0  1  0  0  0  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,19

## ITERATION 154 #######################


> Neighbours evaluated; 62
> Selected Move:	3620	3	11	6	25000


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  1  1  0  1  0  0  1  0  0  0  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 155 #######################


> Neighbours evaluated; 62
> Selected Move:	3620	4	19	6	24800


> New Y[]: 
	
	 2  0  4  0  0  0  3  0  0  1  1  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 156 #######################


> Neighbours evaluated; 60
> Selected Move:	3640	3	6	5	25100


> New Y[]: 
	
	 2  0  4  0  0  3  0  0  0  1  1  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,205

## ITERATION 157 #######################


> Neighbours evaluated; 64
> Selected Move:	3620	3	5	1	23000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  1  1  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,21

## ITERATION 158 #######################


> Neighbours evaluated; 92
> Selected Move:	3650	3	2	8	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  4  1  1  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,205

## ITERATION 159 #######################


> Neighbours evaluated; 64
> Selected Move:	3650	4	8	12	23300


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  1  0  4  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,2

## ITERATION 160 #######################


> Neighbours evaluated; 86
> Selected Move:	3660	3	19	14	24800


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  1  0  4  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,195

## ITERATION 161 #######################


> Neighbours evaluated; 40
> Selected Move:	3792	3	8	6	25300


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  1  1  0  4  0  1  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 162 #######################


> Neighbours evaluated; 44
> Selected Move:	3736	4	12	14	25600


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  1  1  0  1  0  4  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 163 #######################


> Neighbours evaluated; 46
> Selected Move:	3665	4	14	6	26000


> New Y[]: 
	
	 2  3  0  0  0  0  4  0  0  1  1  0  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 164 #######################


> Neighbours evaluated; 58
> Selected Move:	3520	3	6	2	24500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  1  1  0  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,175

## ITERATION 165 #######################


> Neighbours evaluated; 50
> Selected Move:	3663	3	9	6	25500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  1  0  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 166 #######################


> Neighbours evaluated; 81
> Selected Move:	3560	3	6	8	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  1  0  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,175

## ITERATION 167 #######################


> Neighbours evaluated; 59
> Selected Move:	3650	3	14	9	23000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  1  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,17

## ITERATION 168 #######################


> Neighbours evaluated; 71
> Selected Move:	3660	3	2	7	24900


> New Y[]: 
	
	 2  3  0  0  0  0  0  4  1  1  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 169 #######################


> Neighbours evaluated; 45
> Selected Move:	3650	3	7	19	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  1  0  1  0  0  1  0  0  0  4 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,16

## ITERATION 170 #######################


> Neighbours evaluated; 73
> Selected Move:	3644	3	19	14	25100


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  1  0  1  0  4  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,165

## ITERATION 171 #######################


> Neighbours evaluated; 53
> Selected Move:	3630	3	14	18	24800


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  1  0  1  0  0  1  0  0  4  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,16

## ITERATION 172 #######################


> Neighbours evaluated; 66
> Selected Move:	3662	3	8	6	25300


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  1  1  0  1  0  0  1  0  0  4  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 173 #######################


> Neighbours evaluated; 62
> Selected Move:	3586	4	18	12	25800


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  1  1  0  4  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 174 #######################


> Neighbours evaluated; 62
> Selected Move:	3585	3	6	8	25300


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  1  0  4  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,155

## ITERATION 175 #######################


> Neighbours evaluated; 81
> Selected Move:	3614	3	18	7	25300


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  1  1  0  4  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 176 #######################


> Neighbours evaluated; 39
> Selected Move:	3620	2	10	-1	20800


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  1  0  0  4  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 177 #######################


> Neighbours evaluated; 59
> Selected Move:	3620	4	12	7	20400


> New Y[]: 
	
	 2  3  0  0  0  0  0  4  1  1  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 178 #######################


> Neighbours evaluated; 59
> Selected Move:	3630	1	-1	4	24900


> New Y[]: 
	
	 2  3  0  0  1  0  0  4  1  1  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 179 #######################


> Neighbours evaluated; 43
> Selected Move:	3630	3	4	19	24900


> New Y[]: 
	
	 2  3  0  0  0  0  0  4  1  1  0  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 180 #######################


> Neighbours evaluated; 70
> Selected Move:	3640	3	7	11	24900


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  0  4  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 181 #######################


> Neighbours evaluated; 75
> Selected Move:	3640	4	11	12	24300


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  0  1  4  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 182 #######################


> Neighbours evaluated; 87
> Selected Move:	3640	3	8	16	24800


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  0  1  4  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 183 #######################


> Neighbours evaluated; 88
> Selected Move:	3680	3	19	4	24800


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  1  0  1  4  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 184 #######################


> Neighbours evaluated; 78
> Selected Move:	3660	3	4	10	24800


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  1  1  4  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,155

## ITERATION 185 #######################


> Neighbours evaluated; 75
> Selected Move:	3640	3	11	4	23800


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  1  1  0  4  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 186 #######################


> Neighbours evaluated; 87
> Selected Move:	3620	3	4	19	23800


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  1  0  4  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 187 #######################


> Neighbours evaluated; 89
> Selected Move:	3620	4	12	19	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  1  0  1  0  0  1  1  0  0  4 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 188 #######################


> Neighbours evaluated; 78
> Selected Move:	3612	3	19	4	25200


> New Y[]: 
	
	 2  3  0  0  4  0  0  0  0  1  1  0  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 189 #######################


> Neighbours evaluated; 70
> Selected Move:	3613	4	4	16	25200


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  1  1  0  1  0  0  1  4  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 190 #######################


> Neighbours evaluated; 75
> Selected Move:	3640	3	16	2	23000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  1  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,125

## ITERATION 191 #######################


> Neighbours evaluated; 52
> Selected Move:	3685	1	-1	6	28000


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  0  1  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 192 #######################


> Neighbours evaluated; 48
> Selected Move:	3680	3	4	19	28000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  1  1  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 193 #######################


> Neighbours evaluated; 67
> Selected Move:	3620	4	1	12	23700


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  1  1  0  3  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,11

## ITERATION 194 #######################


> Neighbours evaluated; 97
> Selected Move:	3643	3	9	5	25700


> New Y[]: 
	
	 2  0  4  0  0  1  1  0  0  0  1  0  3  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 195 #######################


> Neighbours evaluated; 75
> Selected Move:	3680	3	19	4	25700


> New Y[]: 
	
	 2  0  4  0  1  1  1  0  0  0  1  0  3  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 196 #######################


> Neighbours evaluated; 79
> Selected Move:	3676	3	6	16	25700


> New Y[]: 
	
	 2  0  4  0  1  1  0  0  0  0  1  0  3  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 197 #######################


> Neighbours evaluated; 93
> Selected Move:	3665	3	5	11	25200


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  1  1  3  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 198 #######################


> Neighbours evaluated; 89
> Selected Move:	3630	3	12	17	25000


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  1  1  0  0  0  1  1  3  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 199 #######################


> Neighbours evaluated; 89
> Selected Move:	3655	3	16	5	26000


> New Y[]: 
	
	 2  0  4  0  1  1  0  0  0  0  1  1  0  0  0  1  0  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 200 #######################


> Neighbours evaluated; 87
> Selected Move:	3630	3	4	19	26000


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  0  1  1  0  0  0  1  0  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 201 #######################


> Neighbours evaluated; 71
> Selected Move:	3596	4	17	11	26200


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  0  1  3  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 202 #######################


> Neighbours evaluated; 71
> Selected Move:	3610	3	11	1	24000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  1  0  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 203 #######################


> Neighbours evaluated; 99
> Selected Move:	3660	3	10	6	24500


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  0  0  0  0  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 204 #######################


> Neighbours evaluated; 104
> Selected Move:	3700	3	19	4	24500


> New Y[]: 
	
	 2  3  4  0  1  1  1  0  0  0  0  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 205 #######################


> Neighbours evaluated; 110
> Selected Move:	3700	3	6	8	24000


> New Y[]: 
	
	 2  3  4  0  1  1  0  0  1  0  0  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 206 #######################


> Neighbours evaluated; 106
> Selected Move:	3700	3	8	16	24500


> New Y[]: 
	
	 2  3  4  0  1  1  0  0  0  0  0  0  0  0  0  1  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 207 #######################


> Neighbours evaluated; 105
> Selected Move:	3660	3	4	19	24500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  0  0  0  0  0  1  1  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 208 #######################


> Neighbours evaluated; 94
> Selected Move:	3660	3	16	8	24000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  1  0  0  0  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 209 #######################


> Neighbours evaluated; 100
> Selected Move:	3650	3	17	13	25000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  1  0  0  0  0  1  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 210 #######################


> Neighbours evaluated; 86
> Selected Move:	3670	3	19	4	25000


> New Y[]: 
	
	 2  3  4  0  1  1  0  0  1  0  0  0  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 211 #######################


> Neighbours evaluated; 86
> Selected Move:	3628	3	8	16	25500


> New Y[]: 
	
	 2  3  4  0  1  1  0  0  0  0  0  0  0  1  0  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 212 #######################


> Neighbours evaluated; 89
> Selected Move:	3630	3	5	11	25000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  0  1  0  1  0  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 213 #######################


> Neighbours evaluated; 104
> Selected Move:	3650	3	16	9	24000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  1  0  1  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 214 #######################


> Neighbours evaluated; 91
> Selected Move:	3630	3	4	19	24000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  1  0  1  0  1  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 215 #######################


> Neighbours evaluated; 112
> Selected Move:	3610	3	13	3	24000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  1  0  1  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 216 #######################


> Neighbours evaluated; 116
> Selected Move:	3630	3	19	4	24000


> New Y[]: 
	
	 2  3  4  1  1  0  0  0  0  1  0  1  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,115
________________________________________________________________

Best solution found: 3850
Run Termination time: 31.01.2010 10:57:36
Run duration: 00:01:40.9531250
________________________________________________________________
